A Rainbow Coverage Path Planning for a Patrolling Mobile Robot With Circular Sensing Range
نویسندگان
چکیده
منابع مشابه
Planning with Sensing for a Mobile Robot
1 I n t r o d u c t i o n In recent years there has been an at tempt to reconcile the theoretical work on reasoning about action with the realization of agents, in particular mobile robots. Such a field of research has been referred to as Cognitive Robotics [10]. A mobile robot can indeed be regarded as an intelligent agent, tha t is designed both to achieve high-level goals and to be able to p...
متن کاملVirtual Door-Based Coverage Path Planning for Mobile Robot
This paper presents a novel coverage path planning method in indoor environment for a mobile robot such as cleaning robot. Overall region is divided into several sub-regions based on the virtually extracted doors. The algorithm is inspired from the usual way of dividing an indoor environment into sub-regions, i.e., rooms based on the identification of doors. The virtual door algorithm extracts ...
متن کاملCoverage Path Planning Using Mobile Robot Team Formations
The multi-robot coverage path-planning problem involves finding collision-free paths for a set of robots so that they can completely cover the surface of an environment. This problem is non-trivial as the geometry and location of obstacles in the environment is usually not known a priori by the robots, and they have to adapt their coverage path as they discover obstacles while moving in the env...
متن کاملOptimal Trajectory Planning of a Mobile Robot with Spatial Manipulator For Spatial Obstacle Avoidance
Mobile robots that consist of a mobile platform with one or many manipulators mounted on it are of great interest in a number of applications. Combination of platform and manipulator causes robot operates in extended work space. The analysis of these systems includes kinematics redundancy that makes more complicated problem. However, it gives more feasibility to robotic systems because of the e...
متن کاملMulti-Robot Path Planning for Selective Coverage
In this paper we propose a reward-driven finitehorizon model akin to a Markov Decision Process to extract the maximum amount of valuable data in least amount of time. We present a path planning algorithm that generates off-line trajectories for multiple robots to cover a region of interest by visiting the hot-spots in increasing order of their significance. An underlying distribution is assumed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Systems, Man, and Cybernetics: Systems
سال: 2018
ISSN: 2168-2216,2168-2232
DOI: 10.1109/tsmc.2017.2662623